Harnessing a Refinement Theory to Compute Loop Functions
نویسندگان
چکیده
منابع مشابه
Harnessing a Refinement Theory to Compute Loop Functions
We consider a while loop on some space S and we are interested in deriving the function that this loop defines between its initial states and its final states (when it terminates). Such a capability is useful in a wide range of applications, including reverse engineering, software maintenance, program comprehension, and program verification. In the absence of a general theoretical solution to t...
متن کاملUsage of Assembled Functions Theory for Compute Dynamic Response of a Tunnel
در این پژوهش یک پاسخ تحلیلی برای ارزیابی پاسخ دینامیکی تونل در محیط های متخلخل ایزوتروپ با استفاده از تئوری تجمع توابع ارائه شده است. برای حل معادلات، دو گروه از توابع پیچیده برای ساختمان جامد و مایع نفوذی در یک سیستم پیچیده دو بعدی معرفی شده اند. تنش، جابجایی و فشارهای منفی ناشی از حوادث حاد در محیط و به ویژه در مجاورت حفره در این طرح پیچیده ارزیابی می شود. اعتبار راه حل پیشنهادی با نمونه های ...
متن کاملApplications of subordination theory to starlike functions
Let $p$ be an analytic function defined on the open unit disc $mathbb{D}$ with $p(0)=1.$ The conditions on $alpha$ and $beta$ are derived for $p(z)$ to be subordinate to $1+4z/3+2z^{2}/3=:varphi_{C}(z)$ when $(1-alpha)p(z)+alpha p^{2}(z)+beta zp'(z)/p(z)$ is subordinate to $e^{z}$. Similar problems were investigated for $p(z)$ to lie in a region bounded by lemniscate of Bernoulli $|w^{2}-1|=1$ ...
متن کاملUsing Generating Functions to Compute Concurrency
We present succinctly the Arnold-Nivat's model for the synchronization of sequential preocesses, and we recall the concurrency measure defined by Beauquier, Dérard and Thimonier. We present here a new technics for the computation of this measure avoiding very often a very expensive part of the computation. We illustrate this method by the mutual exclusion example.
متن کاملHow to Compute Loop Corrections to Bethe Approximation
We introduce a method for computing corrections to Bethe approximation for spin models on arbitrary lattices. Unlike cluster variational methods, the new approach takes into account fluctuations on all length scales. The derivation of the leading correction is explained and applied to two simple examples: the ferromagnetic Ising model on d-dimensional lattices, and the spin glass on random grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.010